Nonstationary Erlang Loss Queues and Networks

نویسندگان

  • KHALID ABDULAZIZ ALNOWIBET
  • Thomas Reiland
  • Harry Perros
چکیده

ALNOWIBET, KHALID ABDULAZIZ Nonstationary Erlang Loss Queues and Networks. (Under the direction of Dr. Harry Perros) The nonstationary Erlang loss model is a queueing system consisting of a finite number of servers and no waiting room with a nonstationary arrival process or a time-dependent service rate. The Erlang loss model is commonly used to model and evaluate many communication systems. Often, these types of service systems encounter a change in the arrival rate over time while the service rate remains either constant or changes very little over time. In view of this, the focus in this research is the nonstationary Erlang loss queues and network with time-dependent arrival rate and constant service rate. We developed an iterative scheme referred to as the fixed point approximation (FPA) in order to obtain the time-dependent blocking probability and other measures for a single-class nonstationary Erlang loss queue and a nonstationary multi-rate Erlang loss queue. The FPA method was compared against exact numerical results, and two other methods, namely, MOL and PSA, for various nonstationary Erlang loss queues with sinusoidal arrival rates. Although we used sinusoidal functions to model the time-dependent arrival rate, the solution can be obtained for any arrival rate function. Experimental results demonstrate that the FPA algorithm provides an exact solution for nonstationary Erlang loss queue. The FPA algorithm was also applied to the case of multi-rate nonstationary Erlang loss queues and the results obtained were compared with simulation. We generalized the FPA algorithm for networks of nonstationary Erlang loss queues with Markovian branching, and compared its accuracy to simulation. Finally, FPA was used to analyze networks of nonstationary Erlang loss queues with population constraints. Numerical results showed that FPA provides a good approximation. NONSTATIONARY ERLANG LOSS QUEUES AND NETWORKS by KHALID ABDULAZIZ ALNOWIBET A dissertation submitted to the Graduate Faculty of North Carolina State University in partial satisfaction of the requirements for the Degree of Doctor of Philosophy OPERATIONS RESEARCH

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonstationary analysis of the loss queue and of queueing networks of loss queues

We present an iterative scheme based on the fixed point approximation method, for the numerical calculation of the time-dependent mean number of customers and blocking probability functions in a nonstationary queueing network with multi-rate loss queues. We first show how the proposed method can be used to analyze a single-class, multiclass, and multi-rate nonstationary loss queue. Subsequently...

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

Blocking Probabilities in Mobile Communications Networks with Time-Varying Rates and Redialing Subscribers

Call-blocking probabilities are among the key performance measures in mobile communications networks. For the analysis of these blocking probabilities, mobile networks can be modelled as networks of Erlang loss queues with common capacity restrictions dictated by the distribution of frequencies over the cells of the network. However, due to the time-varying load offered to the cells of such net...

متن کامل

Two basic queueing problems in communications

Finite queues with overflow are most natural in communications (in both circuit and packet switch networks). For such queues, there is no simple analytic expression for the loss probability. It is shown however that the principle of call packing leads to • an upper bound (for the loss probability) • an analytic error bound for its accuracy and • a quite reasonable approximation (superior to Erl...

متن کامل

The Dynamic Analysis and Design of A Communication link with Stationary and Nonstationary Arrivals

Most research in queueing theory is typically based on the steady-state analysis. In today’s dynamically changing traffic environment, the steady-state analysis may not provide enough information to operators regarding Quality of Service (QoS) requirements and dynamic design. In addition, the steady state analysis is not practical for nonstationary arrivals. In this paper, we consider the time-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004